The smallestn-uniform hypergraph with positive discrepancy
نویسندگان
چکیده
منابع مشابه
SMALLEST n-UNIFORM HYPERGRAPH WITH POSITIVE DISCREPANCY
A two-coloring of the vertices X of the hypergraph H = ( X , o °) by red and blue has discrepancy d if d is the largest difference between the number of red and blue points in any edge. A two-coloring is an equipartition of H if it has discrepancy 0, i.e., every edge is exactly half red and half blue. Letf(n) be the fewest number of edges in an n-uniform hypergraph (all edges have size n) havin...
متن کاملThe Laplacian of a uniform hypergraph
In this paper, we investigate the Laplacian, i.e., the normalized Laplacian tensor of a k-uniform hypergraph. We show that the real parts of all the eigenvalues of the Laplacian are in the interval [0, 2], and the real part is zero (respectively two) if and only if the eigenvalue is zero (respectively two). All the H+-eigenvalues of the Laplacian and all the smallest H+-eigenvalues of its sub-t...
متن کاملThe Hardness of 3 - Uniform Hypergraph Coloring
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5) colors. Our result immediately implies that for any constants k ≥ 3 and c2 > c1 > 1, coloring a k-uniform c1-colorable hypergraph with c2 colors is NP-hard; the case k = 2, however, remains wide open. This is the first hardness re...
متن کاملON SENSITIVITY OF k-UNIFORM HYPERGRAPH PROPERTIES
In this paper we present a graph property with sensitivity Θ( √ n), where n = (v 2 ) is the number of variables, and generalize it to a k-uniform hypergraph property with sensitivity Θ( √ n), where n = (v k ) is again the number of variables. This yields the smallest sensitivity yet achieved for a k-uniform hypergraph property. We then show that, for even k, there is a k-uniform hypergraph prop...
متن کاملApproximate Hypergraph Coloring under Low-discrepancy and Related Promises
A hypergraph is said to be χ-colorable if its vertices can be colored with χ colors so that no hyperedge is monochromatic. 2-colorability is a fundamental property (called Property B) of hypergraphs and is extensively studied in combinatorics. Algorithmically, however, given a 2-colorable k-uniform hypergraph, it is NP-hard to find a 2-coloring miscoloring fewer than a fraction 2−k+1 of hypered...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 1987
ISSN: 0209-9683,1439-6912
DOI: 10.1007/bf02579446